Descriptional Complexity of Error/Edit Systems
نویسندگان
چکیده
منابع مشابه
Sequential Versus Parallel Grammar Formalisms with Respect to Measures of Descriptional Complexity
For tabled Lindenmayer systems and their languages, the degree of synchronization and the degree of nondeterminism are well investigated measures of descriptional complexity. In this paper the sequential counterparts of tabled Lindenmayer systems, namely cooperating distributed grammar systems and their pure variant (working in the so called t-mode of derivation) are treated with respect to the...
متن کاملA Low Complexity Forward Error Correction for PAPR reduction in OFDM Systems
In this paper, a Peak to Average Power Ratio (PAPR) reduction technique in Orthogonal Frequency Division Multiplexing (OFDM) systems is proposed. This technique uses error correction capability of channel coding to reduce the PAPR.The coded bits at the input of OFDM modulator are separated into two groups of the Most Significant Bits (MSB) and the LeastSignificant Bits (LSB). The bits are mappe...
متن کاملOn the Descriptional Complexity of Limited Propagating Lindenmayer Systems
We investigate the descriptional complexity of limited propagating Lindenmayer systems and their deterministic and tabled variants with respect to the number of rules and the number of symbols. We determine the decrease of complexity when the generative capacity is increased. For incomparable families, we give languages that can be described more efficiently in either of these families than in ...
متن کاملSome hierarchies for the communication complexity measures of cooperating grammar systems.dvi
We investigate here the descriptional and the computational complexity of parallel communicating grammar systems (PCGS). A new descriptional complexity measure the communication structure of the PCGS is introduced and related to the communication complexity (the number of communications). Several hierarchies resulting from these complexity measures and some relations between the measures are es...
متن کاملDescriptional Complexity of Generalized Forbidding Grammars
This paper discusses the descriptional complexity of generalized forbidding grammars in context of degrees, numbers of nonterminals and conditional productions, and a new descriptional complexity measure—an index—of generalized forbidding grammars.
متن کامل